#include <iostream>
#include <cstring>

using namespace std;

int n, m;
const int N = 100010;
int h[N], e[N], ne[N], idx;
int d[N], q[N];
int hh = 0, tt = -1;

void init() {
	idx = 0;
	memset(h, -1, sizeof(h));
}

void add(int a, int b) {
	e[idx] = b, ne[idx] = h[a], h[a] = idx++;
	d[b]++;
}

void topsort() {
	for (int i = 1; i <= n; i++) {
		if (d[i] == 0) {
			q[++tt] = i;
		}
	}

	while (hh <= tt) {
		int a = q[hh++];
		for (int i = h[a]; i != -1; i = ne[i]) {
			int j = e[i];
			d[j]--;
			if (d[j] == 0) {
				q[++tt] = j;
			}
		}
	}

	if (tt == n - 1) {
		for (int i = 0; i < n; i++) {
			cout << q[i] << " ";
		}
		cout << endl;
	}
	else cout << -1 << endl;
}

int main() {
	cin >> n >> m;
	init();
	while (m--) {
		int a, b;
		cin >> a >> b;
		add(a, b);
	}

	topsort();

	return 0;
}